On a Nine-Point Conic, etc.

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Conic Construction of a Triangle From Its Incenter, Nine-point Center, and a Vertex

We construct a triangle given its incenter, nine-point center and a vertex by locating the circumcenter as an intersection of two rectangular hyperbolas. Some special configurations leading to solutions constructible with ruler and compass are studied. The related problem of construction of a triangle given its circumcenter, incenter, and one vertex is revisited, and it is established that such...

متن کامل

Interactive Reference Point Procedure Based on the Conic Scalarizing Function

In multiobjective optimization methods, multiple conflicting objectives are typically converted into a single objective optimization problem with the help of scalarizing functions. The conic scalarizing function is a general characterization of Benson proper efficient solutions of non-convex multiobjective problems in terms of saddle points of scalar Lagrangian functions. This approach preserve...

متن کامل

Generating the Nine-Point Graphs

A program has been written which recently generated all the (unlabelled) nine-point graphs. Written in MACRO-10 assembly language and run on a 165K PDP10, it generates the complete set of 274,668 graphs in less than six hours. The algorithm on which this program is based is discussed with an emphasis on coding of graphs and various programming techniques designed to save space and time during e...

متن کامل

A homogeneous interior-point algorithm for nonsymmetric convex conic optimization

A homogeneous infeasible-start interior-point algorithm for solving nonsymmetric convex conic optimization problems is presented. Starting each iteration from the vicinity of the central path, the method steps in the approximate tangent direction and then applies a correction phase to locate the next well-centered primal-dual point. Features of the algorithm include that it makes use only of th...

متن کامل

On implementing a primal-dual interior-point method for conic quadratic optimization

Conic quadratic optimization is the problem of minimizing a linear function subject to the intersection of an affine set and the product of quadratic cones. The problem is a convex optimization problem and has numerous applications in engineering, economics, and other areas of science. Indeed, linear and convex quadratic optimization is a special case. Conic quadratic optimization problems can ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the Edinburgh Mathematical Society

سال: 1905

ISSN: 0013-0915,1464-3839

DOI: 10.1017/s0013091500033289